Mashup-Oriented API Recommendation via Random Walk on Knowledge Graph
نویسندگان
چکیده
منابع مشابه
Efficient, Interactive Recommendation of Mashup Composition Knowledge
In this paper, we approach the problem of interactively querying and recommending composition knowledge in the form of re-usable composition patterns. The goal is that of aiding developers in their composition task. We specifically focus on mashups and browser-based modeling tools, a domain that increasingly targets also people without profound programming experience. The problem is generally c...
متن کاملAssisted Mashup Development: On the Discovery and Recommendation of Mashup Composition Knowledge
Over the past few years, mashup development has been made more accessible with tools such as Yahoo! Pipes that help in making the development task simpler through simplifying technologies. However, mashup development is still a difficult task that requires knowledge about the functionality of web APIs, parameter settings, data mappings, among other development efforts. In this work, we aim at a...
متن کاملFast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it suffers from the expensive computational cost which is at least O(n) or O(m) for graphs with n nodes and m edges. In this paper, we propose Ark, a set of fast algorithms for random walk graph kernel computation. Ark is...
متن کاملSafe Medicine Recommendation via Medical Knowledge Graph Embedding
Most of the existing medicine recommendation systems that are mainly based on electronic medical records (EMRs) are significantly assisting doctors to make better clinical decisions benefiting both patients and caregivers. Even though the growth of EMRs is at a lighting fast speed in the era of big data, content limitations in EMRs restrain the existed recommendation systems to reflect relevant...
متن کاملQuantum Random Walk via Classical Random Walk With Internal States
In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2018.2890156